The Complexity of Propositional Proofs
نویسنده
چکیده
Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.
منابع مشابه
On meta complexity of propositional formulas and propositional proofs
A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional language, the article suggests to define the complexity by the size of external descriptions of such constructions. The main result is a lower bound on proof complexity with respect to this new definition of complexity.
متن کاملPropositional Proof Complexity: A Depth Oral Survey
Propositional proof complexity is the study of the lengths of propositional proofs in various different proof systems and is ultimately aimed at settling the open problem of whether the complexity classes NP and coNP are equal. Although the history of logic and proofs dates back to antiquity, the formal study of proof complexity is relatively new. Tseitin published the first major proof complex...
متن کاملFinite Fields and Propositional Proof Systems
Propositional proof complexity is a well established area of theoretical computer science; it is an area of research intimately connected with complexity theory and automated reasoning. In this paper we introduce a proof system, which we call A (a fragment of the theory LA), for formalizing algebraic proofs over arbitrary fields, and we show how to translate formulas and proofs overA into propo...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملCombinatorial Proof Semantics
The paper Proofs Without Syntax [Annals of Mathematics, to appear] introduced the notion of a combinatorial proof for classical propositional logic. The present paper uses combinatorial proofs to define a semantics for classical propositional sequent calculus, an inductive translation from sequent proofs to combinatorial proofs. The semantics is abstract and efficient: abstract in the sense tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bulletin of Symbolic Logic
دوره 13 شماره
صفحات -
تاریخ انتشار 2007